A theory of knockout tournament seedings
نویسنده
چکیده
This paper provides nested sets and vector representations of knockout tournaments. The paper introduces classification of probability domain assumptions and a new set of axioms. Two new seeding methods are proposed: equal gap seeding and increasing competitive intensity seeding. Under different probability domain assumptions, several axiomatic justifications are obtained for equal gap seeding. A discrete optimization approach is developed. It is applied to justify equal gap seeding and increasing competitive intensity seeding. Some justification for standard seeding is obtained. Combinatorial properties of the seedings are studied.
منابع مشابه
Efficient Simulation of a Random Knockout Tournament
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...
متن کاملSeeding, Competitive Intensity and Quality in Knock-out Tournaments
University Higher School of Economics (HSE). Any opinions or claims contained in this Working Paper do not necessarily reflect the views of HSE What is the optimal way to seed a knockout tournament in order to maximize the overall spectator interest in it? Seeding affects the set of matches being played in the tournament, while neutral spectators tend to prefer to watch (i) close and intense ma...
متن کاملBroadening the Scope of Optimal Seeding Analysis in Knockout Tournaments
Optimal seeding in balanced knockout tournaments has only been studied in very limited settings, for example, maximizing predictive power for up to 8 players using only the relative ranking of the players (ordinal information). We dramatically broaden the scope of the analysis along several dimensions. First, we propose a heuristic algorithm that makes use of available cardinal information and ...
متن کاملOptimal Seedings in Elimination Tournaments:
We study an elimination tournament with heterogenous contestants whose ability is common-knowledge. Each pair-wise match is modeled as an all-pay auction where the winner gets the right to compete at the next round. Equilibrium efforts are in mixed strategies, yielding rather complex play dynamics: the endogenous win probabilities in each match depend on the outcome of other matches through the...
متن کاملA Logistic Regression / Markov Chain Model For NCAA Basketball
Each year, more than $3 billion is wagered on the NCAA Division I men’s basketball tournament. Most of that money is wagered in pools where the object is to correctly predict winners of each game, with emphasis on the last four teams remaining (the Final Four). In this paper, we present a combined logistic regression/Markov chain (LRMC) model for predicting the outcome of NCAA tournament games ...
متن کامل